from math import sqrt

def isPrime(n):
    if not(isinstance(n, int)) or n <= 1:
        return False

    for i in range(2, int(sqrt(n)) + 1):
        if (n % i == 0):
            return False

    return True

if __name__ == "__main__":
    n = input("输入一个大于2的偶数:")
    while not(n.isdigit()) or ((n := int(n)) % 2 != 0):
        n = input("输入错误\n输入一个大于2的偶数")

    for i in range(1, n // 2 + 1):
        if isPrime(i) and isPrime(j := (n - i)):
            print("{}+{}={}".format(i, j, n))